Massively Parallel Approximation of Irregular Triangular Meshes with G¹ Parametric Surfaces
نویسنده
چکیده
A new data-parallel algorithm for reconstructing smooth surfaces defined by arbitrary 3D triangular meshes is presented. The obtained surfaces are composed of triangular patches that join with first order geometric continuity. Every patch is generated by a parametric function that approximates the vertices of each control triangle of the mesh. A coarse granularity implementation of those functions, in which each triangular patch is generated on a separate processor, yields the best performances when no communication among processors occurs. The data distribution to attain such an independent task-farm topology is studied. The algorithm has been implemented on a Connection Machine CM-200 system, achieving linear scaling in the number of processors. The simplicity and inherent parallelism of this technique allow its implementation on a wide variety of other parallel and vector architectures.
منابع مشابه
Function approximation on triangular grids: some numerical results using adaptive techniques
Applications of mesh adaption techniques could be found in the numerical solution of PDE’s or in the optimal triangulation of surfaces for shape representation or graphic display. The scope of this work is to verify through numerical experiments the effectiveness of some algorithms for the control of the L∞ error norm for piece–wise linear approximation on 2D unstructured triangular meshes. The...
متن کاملA Uni ed Approach for Hierarchical Adaptive Tesselation of Surfaces
The polygonization, or tesselation, of surfaces is a classical problem that has many practical applications in computer graphics and geometric modeling. The problem consists in computing a piecewise linear approximation for a smooth surface described either by parametric or implicit functions. A polygonal mesh is the one of the simplest forms of surface description and therefore is the represen...
متن کاملCompression of parametric surfaces for efficient 3D model coding
In the field of compression, the type of 3D models traditionally considered is that of polygonal meshes, for which several efficient compression techniques have been proposed in the recent years. Nowadays, an increasing proportion of 3D models are created by a synthesis or modeling process, instead of captured from the real world. Such models are most often given as parametric surfaces, which h...
متن کاملPolynomial Surfaces Interpolating Arbitrary Triangulations
Triangular Bézier patches are an important tool for defining smooth surfaces over arbitrary triangular meshes. The previously introduced 4-split method interpolates the vertices of a 2-manifold triangle mesh by a set of tangent plane continuous triangular Bézier patches of degree five. The resulting surface has an explicit closed form representation and is defined locally. In this paper, we int...
متن کاملDelaunay Triangulation for Curved Surfaces
Surface triangular meshing plays an important role in the areas of computer graphics and engineering analysis. Traditionally, surface meshing is achieved by mapping meshes created in 2D parametric space onto surfaces. Care is taken in generating meshes in the parametric space and mapping them to surfaces because the transformation of geometry from the parameter space to the real space could be ...
متن کامل